An LP-Designed Algorithm for Constraint Satisfaction
نویسندگان
چکیده
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we present an O(nr)-time algorithm. It is the fastest algorithm for most problems in the class (including Max Cut, Max 2-Sat, and weighted Maximum Independent Set), and in combination with “Generalized CSPs” introduced in a companion paper, also allows counting, sampling, and the solution of problems like Max Bisection that escape the usual CSP framework. Linear programming is key to the design as well as the analysis of the algorithm.
منابع مشابه
LP-guided Search for Constraint Satisfaction Problems
Although addressing many of the same problems, the fields of Artificial Intelligence (AI) and Operations Research (OR) were seemingly developed independent of each other. Only recently has an effort been made to collaborate between the two in order to design smarter and faster algorithms. By merging the mathematical programming techniques of OR and the inference and/or randomized methods used i...
متن کاملApproximations and Randomization to Boost CSP Techniques
In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solving hard computational problems. While considerable progress has been made in the integration of these techniques for solving problems that exhibit a mixture of linear and combinatorial constraints, it has been surprisingly diff...
متن کاملExact MAP-inference by Confining Combinatorial Search with LP Relaxation
We consider the MAP-inference problem for graphical models, which is a valued constraint satisfaction problem defined on real numbers with a natural summation operation. We propose a family of relaxations (different from the famous SheraliAdams hierarchy), which naturally define lower bounds for its optimum. This family always contains a tight relaxation and we give an algorithm able to find it...
متن کاملApproximating CSPs Using LP Relaxation
This paper studies how well the standard LP relaxation ap-proximates a k-ary constraint satisfaction problem (CSP) on label set[L]. We show that, assuming the Unique Games Conjecture, it achievesan approximation within O(k · logL) of the optimal approximation fac-tor. In particular we prove the following hardness result: let I be a k-aryCSP on label set [L] with constraints ...
متن کاملTowards a Characterization of Constant-Factor Approximable Min CSPs
We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied constraints in a given instance of CSP(Γ). A recent result of Ene et al. says that, under the mild technical condition that Γ contains the equality relation, the basic LP r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006